CLP performance analysis : Search - tree Visualisation
نویسنده
چکیده
This paper presents the principles of a Constraint Logic Program debug-ging module, currently implemented in the DiSCiPl project 3], which concerns performance debuggging and helps to understand program behaviour in particular in complex combinatorial problems. It is based on search-tree abstractions. It deenes the notion of abstract search-tree and a method to specify it. The originality of the approach lies in its genericity (diierent kinds of abstractions may be deened to analyse the computation space) and the way to specify the abstractions, in particular, using program predicate properties.
منابع مشابه
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate exploration. Typically, only actually traversed goals are memoed in the table. In this paper we present a method where, upon the successful traversal of a subgoal, a generalization of the subgoal is memoed. This enlarges the ...
متن کاملUsing Stochastic Methods to Guide Search in CLP: A Preliminary Report
Recently Lee, Stuckey and Tam have shown the advantages of incorporating stochastic solvers into constraint logic programming (CLP) systems. Their approaches, while efficient, both suffer from some form of incompleteness and complication in semantics. This paper proposes a generalization of these previous efforts by using stochastic methods to guide and speed up the search of derivation trees f...
متن کاملA Tree Search Algorithm for Solving the Container Loading Problem
The paper presents a tree search algorithm for the three-dimensional container loading problem (3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the packed volume is maximized. The method has two variants: the packing variant guarantees full support from below for all packed boxes, while this constraint is not taken ...
متن کاملUsing Stochastic Methods to Guide Search in CLP : a Preliminary
Recently Lee, Stuckey and Tam have shown the feasibility and advantages of incorporating stochastic solvers into constraint logic programming (CLP) systems. Their approaches, while eecient, both suuer from some form of incompleteness and complication in semantics. This paper proposes a generalization of these previous eeorts by using stochastic methods to guide and speed up the search of deriva...
متن کاملDomain Independent Propagation
Recent years have seen the emergence of two main approaches to integrating constraints into logic programming. The CLP Scheme introduces constraints as basic statements over built-in computation domains. On the other hand, systems such as CHIP have introduced new inference rules, which enable certain predicates to be used for propagation thereby pruning the search tree. Unfortunately these two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007